منابع مشابه
Rational Spaces and Set Constraints
Set constraints are inclusions between expressions denoting sets of ground terms They have been used extensively in program analysis and type inference In this paper we investigate the topological structure of the spaces of solutions to systems of set constraints We identify a family of topological spaces called rational spaces which formalize the notion of a topological space with a regular or...
متن کاملNarrowing the Gap between Set-Constraints and CLP(SET)-Constraints
We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint formulae for which both proposals provide suitable procedures for testing constraint satisfiability with respect to a given privileged interpretation. Specifically, we present a technique for reducing any set-constrain...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولSet Constraints and Logic
Set constraints are inclusion relations between expressions denoting sets of ground terms over a ranked alphabet. They are the main ingredient in set-In this paper we describe a constraint logic programming language clp(sc) over set constraints in the style of Jaaar and Lassez 17]. The language subsumes ordinary logic programs over an Herbrand domain. We give an eecient uniication algorithm and...
متن کاملSet Constraints and Automata
We deene a new class of automata which is an acceptor model for mappings from the set of terms T over a ranked alphabet into a set E of labels. When E = f0; 1g n an automaton can be viewed as an acceptor model for n-tuples of tree languages. We prove decidability of emptiness and closure properties for this class of automata. As a consequence of these results, we prove decidability of satissabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00070-9